A Kleene-Schützenberger Theorem for Weighted Event-Clock Automata

A Kleene Theorem for Weighted ω-Pushdown Automata

Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata accepting infinite words by Büchi acceptance. The main result in the proof of the Kleene Theorem is the construction of a weighted ω-pushdown automaton for the ω-algebraic closure of subsets of a continuous star-omega semiring.

A Kleene-Schützenberger Theorem for Weighted Timed Automata

During the last years, weighted timed automata (WTA) have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced by Alur et al. (2001) and Behrmann et al. (2001), permits the treatment of continuous consumption of resources and has led to much resear...

A Kleene/Büchi-like Theorem for Clock Languages

Recognizable Tree Series with Discounting

We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSOlogic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences.

Adding Pebbles to Weighted Automata

We extend weighted automata and weighted rational expressions with 2-way moves and (reusable) pebbles. We show with examples from natural language modeling and quantitative model-checking that weighted expressions and automata with pebbles are more expressive and allow much more natural and intuitive specifications than classical ones. We extend Kleene-Schützenberger theorem showing that weight...